Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
نویسندگان
چکیده
We characterize all pairs of connected graphs {X,Y } such that each 3-connected {X,Y }-free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X,Y } has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs.
منابع مشابه
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs
A graph G is said to be pancyclic if G contains cycles of all lengths from 3 to |V (G)|. We show that if G is 4-connected, claw-free, and P10-free, then G is either pancyclic or it is the line graph of the Petersen graph. This implies that every 4-connected, claw-free, P9-free graph is pancyclic, which is best possible and extends a result of Gould et al. Pancyclicity in 3-connected graphs: Pai...
متن کاملForbidden Subgraphs and Pancyclicity
We prove that every 2{connected K 1;3-free and Z 3 ?free graph is hamiltonian except for two graphs. Furthermore, we give a complete characterization of all 2?connected, K 1;3-free graphs, which are not pancyclic, and which are Z 3-free, B-free, W-free, or HP 7 ?free.
متن کاملForbidden Subgraphs and (k,m)-pancyclicity
A graph G on n vertices is said to be (k, m)-pancyclic if each k-set S ⊆ V (G) is contained in cycles of each of the following lengths: m,m + 1, · · · , n. This property generalizes vertex pancyclicity. There are ten pairs of forbidden subgraphs which guarantee that a 2-connected graph is (k,m)-pancyclic for some integer m ≤ n. We give the best (smallest) possible value for m in each of these t...
متن کاملForbidden subgraphs for chorded pancyclicity
We call a graph G pancyclic if it contains at least one cycle of every possible length m, for 3 ≤ m ≤ |V (G)|. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length 4, 5, . . . , |V (G)|. In particular, certain paths and triangles with...
متن کاملForbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2004